fibonacci cube造句

例句与造句

1. investigate the radius and independence number of Fibonacci cubes.
2. The simplex graph of the complement graph of a path graph is a Fibonacci cube.
3. Every Fibonacci cube has a Hamiltonian path.
4. Fibonacci cubes with an even number of nodes greater than two have a Hamiltonian cycle.
5. The Fibonacci cube may be defined in terms of Fibonacci codes and Hamming distance, independent sets of vertices in path graphs, or via distributive lattices.
6. It's difficult to find fibonacci cube in a sentence. 用fibonacci cube造句挺难的
7. Applications of Fibonacci numbers include computer algorithms such as the Fibonacci search technique and the Fibonacci heap data structure, and graphs called Fibonacci cubes used for interconnecting parallel and distributed systems.
8. The number of antichains in a fence is a Fibonacci number; the distributive lattice with this many elements, generated from a fence via Birkhoff's representation theorem, has as its graph the Fibonacci cube.
9. Thus, e . g ., in the Fibonacci cube of order 4, the sequence constructed in this way is ( 0100-0101-0001-0000-0010 )-( 1010-1000-1001 ), where the parentheses demark the subsequences within the two subgraphs of the partition.
10. The Fibonacci cube is also the graph of a distributive lattice that may be obtained via Birkhoff's representation theorem from a zigzag poset, a partially ordered set defined by an alternating sequence of order relations " a " < " b " > " c " < " d " > " e " < " f " > . . . There is also an alternative graph-theoretic description of the same lattice : the independent sets of any bipartite graph may be given a partial order in which one independent set is less than another if they differ by removing elements from one side of the bipartition and adding elements to the other side of the bipartition; with this order, the independent sets form a distributive lattice, and applying this construction to a path graph results in the lattice associated with the Fibonacci cube.
11. The Fibonacci cube is also the graph of a distributive lattice that may be obtained via Birkhoff's representation theorem from a zigzag poset, a partially ordered set defined by an alternating sequence of order relations " a " < " b " > " c " < " d " > " e " < " f " > . . . There is also an alternative graph-theoretic description of the same lattice : the independent sets of any bipartite graph may be given a partial order in which one independent set is less than another if they differ by removing elements from one side of the bipartition and adding elements to the other side of the bipartition; with this order, the independent sets form a distributive lattice, and applying this construction to a path graph results in the lattice associated with the Fibonacci cube.